Autocratic strategies for alternating games.

نویسندگان

  • Alex McAvoy
  • Christoph Hauert
چکیده

Repeated games have a long tradition in the behavioral sciences and evolutionary biology. Recently, strategies were discovered that permit an unprecedented level of control over repeated interactions by enabling a player to unilaterally enforce linear constraints on payoffs. Here, we extend this theory of "zero-determinant" (or, more generally, "autocratic") strategies to alternating games, which are often biologically more relevant than traditional synchronous games. Alternating games naturally result in asymmetries between players because the first move matters or because players might not move with equal probabilities. In a strictly-alternating game with two players, X and Y, we give conditions for the existence of autocratic strategies for player X when (i) X moves first and (ii) Y moves first. Furthermore, we show that autocratic strategies exist even for (iii) games with randomly-alternating moves. Particularly important categories of autocratic strategies are extortionate and generous strategies, which enforce unfavorable and favorable outcomes for the opponent, respectively. We illustrate these strategies using the continuous Donation Game, in which a player pays a cost to provide a benefit to the opponent according to a continuous cooperative investment level. Asymmetries due to alternating moves could easily arise from dominance hierarchies, and we show that they can endow subordinate players with more autocratic strategies than dominant players.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Autocratic strategies for iterated games with arbitrary action spaces.

The recent discovery of zero-determinant strategies for the iterated prisoner's dilemma sparked a surge of interest in the surprising fact that a player can exert unilateral control over iterated interactions. These remarkable strategies, however, are known to exist only in games in which players choose between two alternative actions such as "cooperate" and "defect." Here we introduce a broade...

متن کامل

The Complexity of Alternating Move Games

We consider infinite duration alternating move games. These games were previously studied by Roth, Balcan, Kalai and Mansour [10]. They presented an FPTAS for computing an approximated equilibrium, and conjectured that there is a polynomial algorithm for finding an exact equilibrium [9]. We extend their study in two directions: (1) We show that finding an exact equilibrium, even for two-player ...

متن کامل

Alternating-time temporal logic with finite-memory strategies

Model-checking the alternating-time temporal logics AT L and AT L∗ with incomplete information is undecidable for perfect recall semantics. However, when restricting to memoryless strategies the model-checking problem becomes decidable. In this paper we consider two other types of semantics based on finite-memory strategies. One where the memory size allowed is bounded and one where the memory ...

متن کامل

The Complexity of Infinitely Repeated Alternating Move Games

We consider infinite duration alternating move games. These games were previously studied by Roth, Balcan, Kalai and Mansour [10]. They presented an FPTAS for computing an approximate equilibrium, and conjectured that there is a polynomial algorithm for finding an exact equilibrium [9]. We extend their study in two directions: (1) We show that finding an exact equilibrium, even for two-player z...

متن کامل

Timed Alternating-Time Temporal Logic

We add freeze quantifiers to the game logic ATL in order to specify real-time objectives for games played on timed structures. We define the semantics of the resulting logic TATL by restricting the players to physically meaningful strategies, which do not prevent time from diverging. We show that TATL can be model checked over timed automaton games. We also specify timed optimization problems f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Theoretical population biology

دوره 113  شماره 

صفحات  -

تاریخ انتشار 2017